Published in: LIPIcs, Volume 173, 28th Annual European Symposium on Algorithms (ESA 2020)
Dániel Marx and R. B. Sandeep. Incompressibility of H-Free Edge Modification Problems: Towards a Dichotomy. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 72:1-72:25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{marx_et_al:LIPIcs.ESA.2020.72, author = {Marx, D\'{a}niel and Sandeep, R. B.}, title = {{Incompressibility of H-Free Edge Modification Problems: Towards a Dichotomy}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {72:1--72:25}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.72}, URN = {urn:nbn:de:0030-drops-129383}, doi = {10.4230/LIPIcs.ESA.2020.72}, annote = {Keywords: incompressibility, edge modification problems, H-free graphs} }
Published in: LIPIcs, Volume 112, 26th Annual European Symposium on Algorithms (ESA 2018)
Yixin Cao, Ashutosh Rai, R. B. Sandeep, and Junjie Ye. A Polynomial Kernel for Diamond-Free Editing. In 26th Annual European Symposium on Algorithms (ESA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 112, pp. 10:1-10:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{cao_et_al:LIPIcs.ESA.2018.10, author = {Cao, Yixin and Rai, Ashutosh and Sandeep, R. B. and Ye, Junjie}, title = {{A Polynomial Kernel for Diamond-Free Editing}}, booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)}, pages = {10:1--10:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-081-1}, ISSN = {1868-8969}, year = {2018}, volume = {112}, editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.10}, URN = {urn:nbn:de:0030-drops-94732}, doi = {10.4230/LIPIcs.ESA.2018.10}, annote = {Keywords: Kernelization, Diamond-free, H-free editing, Graph modification problem} }
Published in: LIPIcs, Volume 43, 10th International Symposium on Parameterized and Exact Computation (IPEC 2015)
R. B. Sandeep and Naveen Sivadasan. Parameterized Lower Bound and Improved Kernel for Diamond-free Edge Deletion. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 365-376, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{sandeep_et_al:LIPIcs.IPEC.2015.365, author = {Sandeep, R. B. and Sivadasan, Naveen}, title = {{Parameterized Lower Bound and Improved Kernel for Diamond-free Edge Deletion}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {365--376}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.365}, URN = {urn:nbn:de:0030-drops-55976}, doi = {10.4230/LIPIcs.IPEC.2015.365}, annote = {Keywords: edge deletion problems, polynomial kernelization} }
Feedback for Dagstuhl Publishing